Personal Web API Recommendation Using Network-based Inference

Abstract. In this paper, we evaluate a generic network-based inference algorithm for Web API recommendation. Based on experimental data collected from the Programmable Web repository, we construct two tripartite networks: one where the nodes are Web APIs, users and mashups, and another where the nodes are Web APIs, users and tags. Experimental results show that the network-based inference algorithm yields higher precision, ranking quality and personalization score when applied to the second network. This approach also outperforms three existing methods: a global ranking method, a collaborative filtering method and the Programmable Web recommendation tool

Web services roadmap: The Semantic Web perspective

Recently the field of Web services has gained focus both in industry and academia. While industry has been mostly interested in standardisation and promotion of the technology, academia has been looking for ways to fit the technology into other frameworks, such as the Semantic Web. Anyway, despite of the increased academic and commercial interest to Web services, there are currently only few case studies available about Web services in the Semantic Web context. Moreover, according to authors ’ knowledge, there is no publicly available study analysing which data is currently mostly provided/required by Web services. In this paper we target these shortcomings by providing a case study of semantically annotated commercial and governmental Web services. We analyse interaction and potential synergy between commercial and governmental Web services. Also the role ontologies for semantic integration of Web services is analysed. Moreover, we identify the most common data exploited by current Web services.

Distributed Agent-Based Web Service Selection, Composition and Analysis through Partial Deduction

In order to facilitate agile business and support online partnership formation, many modern information systems are designed to support interoperability. This tendency has become mainstream with advancements in distributed systems and is supported by the Internet and industrial standards (or standard proposals) like XML, WSDL, SOAP and BPEL. However, increasing complexity of distributed information systems puts forward requirements to high adaptivity of distributed information systems. Alternative technologies have been proposed in academia for supporting adaptivity in information systems. These technologies include cooperative problem solving, agent technology, Web service composition, the Semantic Web and P2P networks. Despite the high potential of such technologies, only few efforts have been made to integrate them into commercial applications. The main aim of this thesis is to investigate and determine to what extent automated Web service composition can be applied in practice. We have implemented a tool, which exploits symbolic negotiation for distributed Web service composition. While applying our approach to automated Web service composition we demonstrate that automated composition methods are useful for analysing Web service domains. More specifically, potential interactions and synergy between different Web services’ domains can be discovered by using automated composition. The main contributions of the thesis are the following. First, it formalises partial deduction for linear logic. Also soundness and completeness of the formalism is proved. Second, it formalises symbolic negotiation with respect to partial deduction and identifies relations between cooperative problem solving and symbolic negotiation. Third, a multi-agent system, utilising the developed formal methods, is designed and implemented. Moreover, the multi-agent system is extended with P2P capabilities. Fourth, a distributedWeb service composition tool is described and implemented. Finally, automatedWeb service composition is evaluated over a set of existing governmental and commercial Web services

Resource-Conscious AI Planning with Conjunctions and Disjunctions

The aim of this work is to develop a resource-conscious Artificial Intelligence (AI) planning system, which allows for nondeterminism in the environment

General Terms Algorithms, Theory

In this paper we propose a formalism for symbolic negotiation. We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is extended with negotiation-specific rules. The underlying CPS formalism was previously presented in [3]. Here we extend the results and position symbolic negotiation according to other distributed problem solving mechanisms